Linear programming relaxation - PDFSEARCH.IO - Document Search Engine

Linear programming relaxation
Results: 230

#	Item
191	On the safety of Gomory cut generators ´rard Cornue ´jols1 , Franc Ge ¸ ois Margot1 , Giacomo Nannicini2 1 Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2013-02-05 11:26:22 Numerical analysis Combinatorial optimization Cutting-plane method Linear programming COIN-OR Linear programming relaxation SCIP Cut Generator Mathematical optimization Operations research Mathematics
192	Experiments with two-row cuts from degenerate tableaux Amitabh Basu Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA[removed]Pierre Bonami LIF, Facult´e des Sciences de Luminy, Universit´e de Marsei Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2010-09-14 17:35:06 Cutting-plane method Triangle Linear programming relaxation C++ classes Money supply Lattice Linear programming Mathematical optimization Geometry Mathematics
193	IEEE TRANS. ON CONTROL OF NETWORK SYSTEMS, JUNE[removed]WITH PROOFS) 1 Convex Relaxation of Optimal Power Flow Part II: Exactness Add to Reading List Source URL: netlab.caltech.edu Language: English - Date: 2014-06-09 02:38:12 Linear programming Mathematics Applied mathematics Second-order cone programming Relaxation Duality Semidefinite programming Mathematical sciences Mathematical optimization Operations research Convex optimization
194	Mathematical Programming manuscript No. (will be inserted by the editor) Pierre Bonami G´erard Cornu´ejols Andrea Lodi Franc¸ois Margot Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2006-04-16 15:22:10 Convex optimization Applied mathematics Linear programming Relaxation Exponentiation Karush–Kuhn–Tucker conditions Ellipsoid method Mathematical optimization Operations research Mathematics
195	Mathematical Programming manuscript No. (will be inserted by the editor) Branching on General Disjunctions Miroslav Karamanov · G´erard Cornu´ejols Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2009-08-09 22:53:56 Combinatorial optimization Cutting-plane method Branch and bound Branching Linear programming relaxation Branch point Linear programming Exponentiation Heuristic function Mathematical optimization Mathematical analysis Mathematics
196	Mathematical Programming manuscript No. (will be inserted by the editor) Improved strategies for branching on general disjunctions G. Cornu´ejols · L. Liberti · G. Nannicini Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2008-07-21 10:04:56 Combinatorial optimization Algebraic combinatorics Representation theory Glycoproteins Immune system Immunoglobulin D Restricted representation Linear programming relaxation Branch and bound Mathematics Mathematical optimization Theoretical computer science
197	How tight is the corner relaxation? Insights gained from the stable set problem G´erard Cornu´ejolsa,1 , Carla Michinib,2,∗, Giacomo Nannicinic,3 a Tepper School of Business, Carnegie Mellon University, Pittsburgh, Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2012-02-13 11:38:14 Combinatorial optimization Operations research Relaxation Convex optimization Linear programming relaxation Linear programming Cutting-plane method Graph Matching Mathematical optimization Mathematics Graph theory
198	An algorithmic framework for convex mixed integer nonlinear programs Pierre Bonami1,5 , Lorenz T. Biegler2 , Andrew R. Conn3 , G´erard Cornu´ejols1,4 , Ignacio E. Grossmann2 , Carl D. Laird2,5 , Jon Lee3 , Andrea Lodi3 Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2006-04-16 15:22:42 Operations research Convex optimization Linear programming Combinatorial optimization Relaxation Approximation algorithm Cutting-plane method Optimization problem Nonlinear programming Mathematical optimization Mathematics Applied mathematics
199	Branching on Split Disjunctions G. NANNICINI a,1 , G. CORNUÉJOLS a,2 , M. KARAMANOV b , L. LIBERTI c,3 a Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA b Capacity and Operations Planning, Bank of Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2010-08-23 17:53:30 Linear programming relaxation Relaxation Valuation Mathematics Combinatorial optimization Linear programming
200	Noname manuscript No. (will be inserted by the editor) Practical strategies for generating rank-1 split cuts in mixed-integer linear programming Gerard Cornu´ Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2011-07-14 10:16:42 Combinatorial optimization Linear programming Convex optimization Cutting-plane method Rank Linear programming relaxation Mathematical optimization Mathematics Operations research

UPDATE